Improved Ackermannian Lower Bound for the Petri Nets Reachability Problem

Petri nets, equivalently presentable as vector addition systems with states, are an established model of concurrency with widespread applications. The reachability problem, where we ask whether from a given initial configuration there exists a sequence of valid execution steps reaching a given final configuration, is the central algorithmic problem for this model. The complexity of the problem has remained, until recently, one of the hardest open questions in verification of concurrent systems. A first upper bound has been provided only in 2015 by Leroux and Schmitz, then refined by the same authors to non-primitive recursive Ackermannian upper bound in 2019. The exponential space lower bound, shown by Lipton already in 1976, remained the only known for over 40 years until a breakthrough non-elementary lower bound by Czerwi?ski, Lasota, Lazic, Leroux and Mazowiecki in 2019. Finally, a matching Ackermannian lower bound announced this year by Czerwi?ski and Orlikowski, and independently by Leroux, established the complexity of the problem. Our primary contribution is an improvement of the former construction, making it conceptually simpler and more direct. On the way we improve the lower bound for vector addition systems with states in fixed dimension (or, equivalently, Petri nets with fixed number of places): while Czerwi?ski and Orlikowski prove F_k-hardness (hardness for kth level in Grzegorczyk Hierarchy) in dimension 6k, our simplified construction yields F_k-hardness already in dimension 3k+2

The slimming effect of advection on black-hole accretion flows

At super-Eddington rates accretion flows onto black holes have been described as slim (aspect ratio $H/R \lesssim 1$) or thick (H/R >1) discs, also known as tori or (Polish) doughnuts. The relation between the two descriptions has never been established, but it was commonly believed that at sufficiently high accretion rates slim discs inflate, becoming thick. We wish to establish under what conditions slim accretion flows become thick. We use analytical equations, numerical 1+1 schemes, and numerical radiative MHD codes to describe and compare various accretion flow models at very high accretion rates.We find that the dominant effect of advection at high accretion rates precludes slim discs becoming thick. At super-Eddington rates accretion flows around black holes can always be considered slim rather than thick.Comment: 8 pages, 5 figures. Astronomy & Astrophysics, in pres

Determinisability of One-Clock Timed Automata

The deterministic membership problem for timed automata asks whether the timed language recognised by a nondeterministic timed automaton can be recognised by a deterministic timed automaton. We show that the problem is decidable when the input automaton is a one-clock nondeterministic timed automaton without epsilon transitions and the number of clocks of the deterministic timed automaton is fixed. We show that the problem in all the other cases is undecidable, i.e., when either 1) the input nondeterministic timed automaton has two clocks or more, or 2) it uses epsilon transitions, or 3) the number of clocks of the output deterministic automaton is not fixed

Parikh Images of Register Automata

As it has been recently shown, Parikh images of languages of nondeterministic one-register automata are rational (but not semilinear in general), but it is still open if the property extends to all register automata. We identify a subclass of nondeterministic register automata, called hierarchical register automata (HRA), with the following two properties: every rational language is recognised by a HRA; and Parikh image of the language of every HRA is rational. In consequence, these two properties make HRA an automata-theoretic characterisation of languages of nondeterministic register automata with rational Parikh images

How Leaders Invest Staffing Resources for Learning Improvement

Analyzes staffing challenges that guide school leaders' resource decisions in the context of a learning improvement agenda, staff resource investment strategies that improve learning outcomes equitably, and ways to win support for differential investment

Deterministic Brownian motion generated from differential delay equations

This paper addresses the question of how Brownian-like motion can arise from the solution of a deterministic differential delay equation. To study this we analytically study the bifurcation properties of an apparently simple differential delay equation and then numerically investigate the probabilistic properties of chaotic solutions of the same equation. Our results show that solutions of the deterministic equation with randomly selected initial conditions display a Gaussian-like density for long time, but the densities are supported on an interval of finite measure. Using these chaotic solutions as velocities, we are able to produce Brownian-like motions, which show statistical properties akin to those of a classical Brownian motion over both short and long time scales. Several conjectures are formulated for the probabilistic properties of the solution of the differential delay equation. Numerical studies suggest that these conjectures could be "universal" for similar types of "chaotic" dynamics, but we have been unable to prove this.Comment: 15 pages, 13 figure

Subordinated Langevin Equations for Anomalous Diffusion in External Potentials - Biasing and Decoupled Forces

The role of external forces in systems exhibiting anomalous diffusion is discussed on the basis of the describing Langevin equations. Since there exist different possibilities to include the effect of an external field the concept of {\it biasing} and {\it decoupled} external fields is introduced. Complementary to the recently established Langevin equations for anomalous diffusion in a time-dependent external force-field [{\it Magdziarz et al., Phys. Rev. Lett. {\bf 101}, 210601 (2008)}] the Langevin formulation of anomalous diffusion in a decoupled time-dependent force-field is derived

A Population of Faint Non-Transient Low Mass Black Hole Binaries

We study the thermal and viscous stability of accretion flows in Low Mass Black Hole Binaries (LMBHBs). We consider a model in which an inner advection-dominated accretion flow (ADAF) is surrounded by a geometrically thin accretion disk, the transition between the two zones occurring at a radius R_tr. In all the known LMBHBs, R_tr appears to be such that the outer disks could suffer from a global thermal-viscous instability. This instability is likely to cause the transient behavior of these systems. However, in most cases, if R_tr were slightly larger than the estimated values, the systems would be globally stable. This suggests that a population of faint persistent LMBHBs with globally stable outer disks could be present in the Galaxy. Such LMBHBs would be hard to detect because they would lack large amplitude outbursts, and because their ADAF zones would have very low radiative efficiencies, making the systems very dim. We present model spectra of such systems covering the optical and X-ray bands.Comment: LateX, 37 pages, 11 figures; Accepted for publication in The Astrophysical Journa

Improved Lower Bounds for Reachability in Vector Addition Systems

We investigate computational complexity of the reachability problem for vector addition systems (or, equivalently, Petri nets), the central algorithmic problem in verification of concurrent systems. Concerning its complexity, after 40 years of stagnation, a non-elementary lower bound has been shown recently: the problem needs a tower of exponentials of time or space, where the height of tower is linear in the input size. We improve on this lower bound, by increasing the height of tower from linear to exponential. As a side-effect, we obtain better lower bounds for vector addition systems of fixed dimension